منابع مشابه
Robust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
متن کاملUncertain random newsboy problem
The classic newsboy problem assumes the market demand to be a random variable. However, when the decision maker wants to expand the market share, he has to provide a subjective estimate of new market demand distribution due to the lack of historical data. Thus, randomness and uncertainty simultaneously appear in a newsboy problem. The aim of this work is to extend the analysis of the classic ne...
متن کاملDynamic Ship Assignment Problem with Uncertain Demands
Product tanker shipping companies in the spot market face severe volatility in demand and in price. We explore shipping companies' two problems: evaluating supply and demand of the market and assigning cargoes in order to maximize profitability. By approximating the market as a queueing system, we obtain utilization ratios, which effectively model supply and demand of the market. This approach ...
متن کاملThe Random Quadratic Assignment Problem
The quadratic assignment problem, QAP, is one of the most difficult of all combinatorial optimization problems. Here, we use an abbreviated application of the statistical mechanics replica method to study the asymptotic behavior of instances in which the entries of at least one of the two matrices that specify the problem are chosen from a random distribution P . Surprisingly, the QAP has not b...
متن کاملThe Random Hypergraph Assignment Problem
Parisi’s famous (proven) conjecture states that the expected cost of an optimal assignment in a complete bipartite graph on n + n nodes with i. i. d. exponential edge costs with mean 1 is ∑n i=1 1/i , which converges to an asymptotic limit of π/6 as n tends to infinity. We consider a generalization of this question to complete “partitioned” bipartite hypergraphs G2,n that contain edges of size ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2018
ISSN: 0307-904X
DOI: 10.1016/j.apm.2017.11.026